基于数据质量评价的目标估计

针对目标估计过程需要大量人工参与、自动化程度低的问题，提出了基于数据质量评价的目标估计方法。利用目标数据质量评价方法，对不同传感器得到的目标数据质量进行科学、有效的测度和评价，并根据质量得分动态调整各数据源在目标估计过程中所占的权重，从而减少人工干预，提高目标估计效能。仿真试验结果证明了该方法的有效性。     

Mutual information maximizing GAN inversion for real face with identity preservation

Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.     

控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

5G核心网业务模型的智能化预测研究

摘 要：核心网业务模型的建立是5G网络容量规划和网络建设的基础，通过现有方法得到的理论业务模型是静态不可变的且与实际网络存在偏离。为了克服现有5G核心网业务模型与现网模型适配性较差以及规划设备无法满足用户实际业务需求的问题，提出了一种长短期记忆（long short-term memory，LSTM）网络与卷积LSTM （convolution LSTM，ConvLSTM）网络双通道融合的 5G 核心网业务模型预测方法。该方法基于人工智能（artificial intelligence，AI）技术以实现高质量的核心网业务模型的智能预测，形成数据反馈闭环，实现网络自优化调整，助力网络智能化建设。     

基于改进灰狼优化算法的服务功能链映射算法

随着工业互联网、车联网、元宇宙等新型互联网应用的兴起，网络的低时延、可靠性、安全性、确定性等方面的需求正面临严峻挑战。采用网络功能虚拟化技术在虚拟网络部署过程中，存在服务功能链映射效率低与部署资源开销大等问题，联合考虑节点激活成本、实例化开销，以最小化平均部署网络成本为优化目标建立了整数线性规划模型，提出基于改进灰狼优化算法的服务功能链映射（improved grey wolf optimization based service function chain mapping，IMGWO-SFCM）算法。该算法在标准灰狼优化算法基础上添加了基于无环K最短路径（K shortest path，KSP）问题算法的映射方案搜索、映射方案编码以及基于反向学习与非线性收敛改进三大策略，较好地平衡了其全局搜索及局部搜索能力，实现服务功能链映射方案的快速确定。仿真结果显示，该算法在保证更高的服务功能链请求接受率下，相较于对比算法降低了11.86%的平均部署网络成本。     

IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化

以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。     

Locating wind farm for power and hydrogen production based on Geographic information system and multi-criteria decision making method: An application

Hydrogen generation from renewable energy resources is considered as a suitable solution to solve the problems related to the energy sector and the reduction of greenhouse gases. The aim of this study is to provide an integrated framework for identifying suitable areas for the construction of wind farms to produce hydrogen. For this purpose, a combined method of Geographic Information System (GIS) and multi-criteria decision making (MCDM) has been used to locate the power plant in Yazd province. The GIS method in the present study consisted of two parts: constraints and criteria. The constraint section included areas that were unsuitable for the construction of wind farms to produce power and hydrogen. In the present study, various aspects such as physical, economic and environmental had been considered as constraints. In the criteria section, eight different criteria from technical aspects (including average wind speed, hydrogen production potential, land slope) and economic aspects (including distance to electricity grid, distance to urban areas, distance to road, distance to railway and distance to centers of High hydrogen consumption) had been investigated. The MCDM tool had been used to weigh the criteria and identify suitable areas. Analytic Hierarchy Process (AHP) technique was used for weighting the criteria. The results of AHP weighting method showed that economic criteria had the highest importance with a value of 0.681. The most significant sub-criterion was the distance to urban areas and the least significant sub-criterion was the distance to power transmission lines. The results of GIS-MCDM analysis had shown that the most proper areas were in the southern and central sectors of Yazd province. In addition, the feasibility of hydrogen production from wind energy had shown that this province had the capacity to generate hydrogen at the rate of 53.6–128.6 tons per year.     

Efficiency evaluation of healthcare services in China based on stochastic multicriteria acceptability analysis and directional distance function

Evaluating the efficiency of healthcare services accurately can help in analyzing the rationality of inputs and outputs in such services. Considering the consistency and equity of assessment criteria, this study conducts the stochastic multicriteria acceptability analysis (SMAA-2) with a directional distance function to evaluate the efficiency of healthcare services in 31 provincial administrative regions of mainland China, as observed in 2018. We use SMAA-DDF to explore all the projection directions to the efficient frontier instead of a certain projection direction. We measure the maximum and average efficiencies for each of the 31 provincial healthcare services. Our empirical findings show that only seven provinces achieve optimal healthcare service efficiency; the eastern area performed the best, followed by the central, western, and northeast areas. Furthermore, the path along the projection directions is provided to help inefficient provinces improve their efficiency and obtain the best possible positions.     

Design of frameworks for self-adaptive service-oriented applications: A systematic analysis

Self-adaptive service-oriented Applications (Self-Apps) must be able to understand themselves or the environment in which they are executed, and propose solutions to meet changing conditions. The development of these applications is not a trivial task, since it encompasses issues from different research areas. Despite the importance of frameworks for Self-Apps, there is a lack of comprehensive analysis of how the design of such applications is performed, and regarding the standardization of concepts and coverage of minimum requirements for Self-Apps. The main contribution of this article is to present this comprehensive analysis, providing the state of the art for this subject. This analysis was built through a Systematic Mapping Study, based on a total of 65 studies, from which we identify the main attributes for Quality of Service (QoS), search strategies, and service management strategies employed in the design of frameworks for Self-Apps. The main aspects of requirements involved in the design of Self-Apps were pointed out to stakeholders. For example, these applications must implement a method for evaluation of QoS based on metrics. We also put forward the S-Frame, a modular solution that brings together the main features for the design of Self-Apps, and describe the main challenges concerning these applications.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.